On interval total colorings of bipartite graphs
نویسندگان
چکیده
An interval total t coloring of a graph G is a total coloring of with colors 1, such that at least one vertex or edge of is colored by color − G 2, , t ... G , 1, 2, , i i t = ... , and the edges incident to each vertex together with are colored by consecutive colors, where is the degree of the vertex in . In this paper interval total colorings of bipartite graphs are investigated. ( ) v V G ∈
منابع مشابه
On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees
A proper edge coloring of a graph with colors 1, 2, 3, . . . is called an interval coloring if the colors on the edges incident to each vertex form an interval of integers. A bipartite graph is (a, b)-biregular if every vertex in one part has degree a and every vertex in the other part has degree b. It has been conjectured that all such graphs have interval colorings. We prove that all (3, 6)-b...
متن کاملOn interval edge-colorings of bipartite graphs of small order
An edge-coloring of a graph G with colors 1, . . . , t is an interval t-coloring if all colors are used, and the colors of edges incident to each vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. The problem of deciding whether a bipartite graph is interval colorable is NP-complete. The smalle...
متن کاملOn Low Rank-Width Colorings
We introduce the concept of low rank-width colorings, generalizing the notion of low tree-depth colorings introduced by Nešetřil and Ossona de Mendez in [25]. We say that a class C of graphs admits low rank-width colorings if there exist functions N : N→ N and Q : N→ N such that for all p ∈ N, every graph G ∈ C can be vertex colored with at most N(p) colors such that the union of any i ≤ p colo...
متن کاملInterval cyclic edge-colorings of graphs
A proper edge-coloring of a graph G with colors 1, , t is called an interval cyclic t coloring if all colors are used, and the edges incident to each vertex ( ) v V G are colored with ( ) G d v consecutive colors by modulo t , where ( ) G d v is the degree of the vertex v in G . In this paper some properties of interval cyclic edge-colorings are investigated. Also, we give some bounds for...
متن کاملInterval Total Colorings of Bipartite Graphs
A total coloring of a graph G is a coloring of its vertices and edges such that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. The concept of total coloring was introduced by V. Vizing [15] and independently by M. Behzad [3]. The total chromatic number χ (G) is the smallest number of colors needed for total coloring of G. In 1965 V. Vizing and M. Behzad c...
متن کامل